Tournament pathwidth and topological containment
نویسندگان
چکیده
منابع مشابه
Tournament pathwidth and topological containment
We prove that for every set S of tournaments the following are equivalent: • there exists k such that every member of S has pathwidth at most k • there is a digraph H such that no subdivision of H is a subdigraph of any member of S • there exists k such that for each T ∈ S, there do not exist k vertices of T that are pairwise k-connected. As a consequence, we obtain a polynomial-time algorithm ...
متن کاملFrom Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2 · pw(G) + 1, where pw(G) is the pathwidth of G. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width k computes a connected path decomposition of width at most 2k + 1. The running time of the algorithm is O(dk2), where d is the number of ‘bags’ in the input path decomp...
متن کاملPathwidth, trees, and random embeddings
We prove that, for every integer k ≥ 1, every shortest-path metric on a graph of pathwidth k embeds into a distribution over random trees with distortion at most c = c(k), independent of the graph size. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair [GNRS04] states that for every minor-closed family of graphs F , there is a constant c(F) such that the multi-commodity max-flo...
متن کاملTreewidth, Pathwidth and Cospan Decompositions
We will revisit the categorical notion of cospan decompositions of graphs and compare it to the well-known notions of path decomposition and tree decomposition from graph theory. More specifically, we will define several types of cospan decompositions with appropriate width measures and show that these width measures coincide with pathwidth and treewidth. Such graph decompositions of small widt...
متن کاملStrong-mixed searching and pathwidth
In this paper, we propose a new search model, called strongmixed search, which is a generalization of the mixed search. We show that the strong-mixed search number of a graph equals the pathwidth of the graph. We also describe relationships between the strong-mixed search number and other search numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2013
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.03.001